Using Cellular Automata to Simulate Domain Evolution in Proteins
نویسندگان
چکیده
منابع مشابه
Using Cellular Automata to Simulate Epidemic Diseases
In this work, a novel model to simulate epidemic spreading is introduced. It is based on the use of two-dimensional cellular automata, where each cell stand for a square portion of the environment. It is suppose that the distribution of the population is homogeneous, that is, all cells have the same population. The laboratory simulations obtained seem to be in agreement with the real behavior o...
متن کاملUsing Fuzzy Cellular Automata to Access and Simulate Urban Growth
In this paper we present a methodological framework designed to access urban growth dynamics and simulate urban growth. To do so, it utilizes the descriptive power of Fuzzy Logic and Fuzzy Algebra to map the effects of various parameters to the urban growth phenomenon and express them in comprehensible terms. Sensitive Sum, a new fuzzy operator is proposed to employ a parallel connection betwee...
متن کاملIntegrating cellular automata Markov model to simulate future land use change of a tropical basin
Predicting land use change is an indispensable aspect in identifying the best development and management of land resources and their potential. This study used certified land-use maps of 1997, 2006, and 2015 combined with ancillary data such as road networks, water bodies and slopes, obtained from the Department of Agriculture and the Department of Surveying and Mapping in Malaysia, respectivel...
متن کاملSpaSim: A Software to Simulate Cellular Automata Models
Simulation models are a key tool to study the dynamics of ecological systems where space plays a fundamental role. These kinds of models in which the dynamic of the system is space-dependent are called spatial simulation models. The most frequently used approach to simulate spatial models consists of a simulation program (typically developed in a general purposed language) that periodically exp...
متن کاملReversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning automaton is described. Finally, it is shown that there are reversible PA and CA that are able to simulate any reversible PA or CA on any con guration.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Genetics
سال: 2020
ISSN: 1664-8021
DOI: 10.3389/fgene.2020.00515